Set-Term Unification in a Logic Database Language

Deterministic, parallel set-term uniication algorithms for high-order logic-based database languages, of which set terms have the commutative and idempotent properties , are lacking. As a result, an eecient inference mechanism that can be used to determine answers to queries of these database languages deterministically is non-existent. To overcome these shortcomings, we propose a set-term uniication algorithm for LDL=NR, a high-order logic database language. The proposed algorithm not only computes all generalized ground uniiers (ggu s) of a given pair of set terms in LDL=NR without duplicates but also takes the advantage of existing multiple processors for computing all these uniiers in parallel. The proofs of correctness and computational complexity of the proposed algorithm are also included in this paper.